A Model Elimination Calculus with Built-in Theories (Extended Abstract)
نویسنده
چکیده
The model elimination calculus is a linear, refutationally complete calculus for rst order clause logic. We show how to extend this calculus with a framework for theory reasoning. Theory reasoning means to separate the knowledge of a given domain or theory and treat it by special purpose inference rules. We present two versions of theory model elimination: the one is called total theory model elimination (which allows e.g. to treat equality in a rigid E-resolution style), and the other is called partial theory model elimination (which allows e.g. to treat equality in a paramodulation style).
منابع مشابه
Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract)
Narrowing is an important method for solving unification problems in equational theories that are presented by confluent term rewriting systems. Because narrowing is a rather complicated operation, several authors studied calculi in which narrowing is replaced by more simple inference rules. This paper is concerned with one such calculus. Contrary to what has been stated in the literature, we s...
متن کاملProving Strong Normalisation via Non-deterministic Translations into Klop’s Extended λ-Calculus
In this paper we present strong normalisation proofs using a technique of non-deterministic translations into Klop’s extended λ-calculus. We first illustrate the technique by showing strong normalisation of a typed calculus that corresponds to natural deduction with general elimination rules. Then we study its explicit substitution version, the type-free calculus of which does not satisfy PSN w...
متن کاملA systematic proof theory for several modal logics ( extended abstract ) ∗
The family of normal propositional modal logic systems is given a very systematic organisation by their model theory. This model theory is generally given using frame semantics, and it is systematic in the sense that for the most important systems we have a clean, exact correspondence between their constitutive axioms as they are usually given in a HilbertLewis style and conditions on the acces...
متن کاملA Calculus for Concurrent Processes with Constraints
The -calculus is a formal model of concurrent computation based on the notion of naming. It has an important role to play in the search for more abstract theories of concurrent and communicating systems. In this paper we augment the -calculus with a constraint store and add the notion of constraint agent to the standard -calculus concept of agent. We call this extension the -calculus. We also e...
متن کاملSemantic Techniques for Cut-elimination in Higher-order Logics
This paper is part of an ongoing effort to examine the role of extensionality in higher-order logic and provide tools for analyzing higher-order calculi. In an earlier paper, we have presented eight classes of higher order models with respect to various combinations of Boolean extensionality and three forms of functional extensionality. Furthermore, we have developed a methodology of abstract c...
متن کامل